Energy landscapes and persistent minima

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Controlling energy landscapes with correlations between minima

Sai Teja Pusuluri, Alex H. Lang, 3 Pankaj Mehta, 3 and Horacio E. Castillo 4 Department of Physics and Astronomy and Nanoscale and Quantum Phenomena Institute, Ohio University, Athens, OH, 45701, USA Physics Department, Boston University, Boston, Massachusetts 02215, USA Center for Regenerative Medicine, Boston University, Boston, MA, 02215 Corresponding author: [email protected] (Dated: Novemb...

متن کامل

Model-Based Search to Determine Minima in Molecular Energy Landscapes

Search for the global minimum in a molecular energy landscape populated with numerous local minima is a difficult task. Search techniques relevant to such complex spaces can be classified as either global or local. Global search explores the entire space, guaranteeing the global extremum will be found. To accomplish this, the number of samples required grows exponentially with the number of dim...

متن کامل

Barriers and local minima in energy landscapes of stochastic local search

A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive adjacent states in an “energy landscape” defined by the problem instance on the n-dimensional Boolean hypercube. We investigate analytically the worst-case topography of such landscapes in the context of satisfiable k-S...

متن کامل

Escaping free-energy minima.

We introduce a powerful method for exploring the properties of the multidimensional free energy surfaces (FESs) of complex many-body systems by means of coarse-grained non-Markovian dynamics in the space defined by a few collective coordinates. A characteristic feature of these dynamics is the presence of a history-dependent potential term that, in time, fills the minima in the FES, allowing th...

متن کامل

Finding Minima in Complex Landscapes: Annealed, Greedy and Reluctant Algorithms

We consider optimization problems for complex systems in which the cost function has a multivalleyed landscape. We introduce a new class of dynamical algorithms which, using a suitable annealing procedure coupled with a balanced greedy-reluctant strategy drive the systems towards the deepest minimum of the cost function. Results are presented for the Sherrington-Kirkpatrick model of spin-glasses.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Chemical Physics

سال: 2016

ISSN: 0021-9606,1089-7690

DOI: 10.1063/1.4941052